Arithmetic coding revisited

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arithmetic Coding

• Arithmetic Coding is universal • Arithmetic coding is suitable for small alphabet (binary sources) with highly skewed probabilities. • Huffman cannot allocate fractional bits to symbols: , but the algorithm will assign 1 bit. Huffman needs at least one bit per symbol. If, however, the alphabet is large and probabilities are not skewed, Huffman rate is pretty close to entropy (H). , 01 . 0 , 9...

متن کامل

Linear Integer Arithmetic Revisited

We consider feasibility of linear integer programs in the context of verification systems such as SMT solvers or theorem provers. Although satisfiability of linear integer programs is decidable, many stateof-the-art solvers neglect termination in favor of efficiency. It is challenging to design a solver that is both terminating and practically efficient. Recent work by Jovanović and de Moura co...

متن کامل

P-adic arithmetic coding

A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer and incrementally reconstructs a sequence of input symbols. Algorithm is based on certain features of p-adic numbers and p-adic norm. p-adic coding algorithm ...

متن کامل

Tutorial on Arithmetic Coding

This document explains background material for the ling of two patents, EEcient interval width update in arithmetic coding, and Design of fast circuits for code point update in arithmetic coding. The aim is to give the reader the necessary technical foundation to understand the ideas in the patents, and appreciate their signiicance.

متن کامل

Arithmetic Coding in Parallel

We present a cost optimal parallel algorithm for the computation of arithmetic coding. We solve the problem in O(log n) time using n/log n processors on EREW PRAM. This leads to O(n) total cost.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Information Systems

سال: 1998

ISSN: 1046-8188,1558-2868

DOI: 10.1145/290159.290162